Section: New Results

Generation of Implementations Proved Secure in the Computational model

Participants : Bruno Blanchet, David Cadé.

The computational model of protocols considers messages as bitstrings, which is more realistic than the formal model, but also makes the proofs more difficult. Our verifier CryptoVerif is sound in this model. This year, we have continued working on our compiler from CryptoVerif speficications to OCaml. Using CryptoVerif and this compiler, we can prove security properties of specifications of protocols in the computational model and generate runnable implementations from such proved specifications. We have published a journal paper on our implementation of SSH generated using this compiler [13] and a proof that this compiler preserves security [23] , and we have submitted a journal version of this proof. David Cadé also defended his PhD thesis on this topic  [44] .